An Efficient Distributed QoS-based Multicast Routing Algorithm
نویسندگان
چکیده
This paper proposes an eflcient distributed multicast routing algorithm that provides quality of service (QoS) guarantees for real-time applications. It focuses on the delay-constrained minimum cost tree (or constrained Steiner tree) problem; that is, it constructs a multicast tree that not only meets the constrained end-to-end delay requirements but also is the minimum cost multicast tree. This problem has been proved to be NP-complete. Several distributed multicast routing algorithms that are based on heuristics have been proposed in the literature. They can be classified either as a minimum spanning tree (MST) heuristic or as a shortest path (SP) heuristic. Two representative algorithms DKPP and DSPH are MST and SP based heuristics, respectively. The MST based algorithm like DKPP run with a high message and time complexity of O(n’). Furthermore, the MST based algorithms have a very low success rate in constructing a constrained multicast tree especially under tight delay constraints. On the other hand, the SP based algorithms like DSPH have a fatal deficiency; that is, these algorithms will not be able to find a solution if the delay constraint is less than the m i m u m delay of a cost based shortest path tree. Both types of algorithms try to construct the multicast tree sequentially without taking advantage of the concurrency in a distributed algorithm. This paper proposes an eflcient distributed multicast routing algorithm which builds the multicast tree in a concurrent Manner rather than in a sequential manner. As a result, the proposed algorithm runs with a very low message and time complexig and has a near zero failure rate in constructing a multicast tree even under tight delay constraints without any limitation on the value of delay constraints. 0-7803-7371-5/02/$17.00 02002 IEEE 27 Keqin Zhu School of Information Technology and Engineering, University of Ottawa Ottawa, Ontario, K1N 6N5 Canada E-mail: [email protected]
منابع مشابه
Multicast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملAn Efficient Distributed Routing Algorithm for Delay Constrained Multicast
For dynamic QoS multicast routing, efficient handling of node’s join and leave is an important problem. This paper addresses the problem of optimally connecting a new node to an existing multicast tree under sourceto-destination delay and inter-destination delay variation constraints (MRDC-JOIN). We assume a QoS framework where a delay dependent cost function is associated with each network lin...
متن کاملHierarchical PathQoS on a QoS- based Multicast Protocol SRSVP
In this paper, we argue a method to collect information of each existing multicast flow on hierarchical networks. SRSVP, a QoS-based multicast routing protocol, is designed as it collects flow-specific information, called PQ, by putting it into signaling messages, so that the derived QoS path becomes more efficient. HQLIP, an underlying QoS-based unicast routing protocol, handles a network as a...
متن کاملMulticast Distributed Routing Algorithm for Providing Network QoS
Multicast Routing is widely used by various media applications (teleconference, distance learning...). The combination of multicast routing and Quality of Service (QoS) characteristics helps handling the technical requirements and brings better services to end-users. This paper proposes an extension of Distributed Routing Algorithm (DRA) for supporting multicast routing. The proposed algorithm ...
متن کاملQoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks
Quality of service (QoS) based routing and scalability are two key features of multicast routing for the next generation Internetworks. This paper proposes a new protocol called QoS-aware hierarchical multicast routing protocol (QHMRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique. The protocol uses a novel reverse floodi...
متن کاملQoS-Based Multicast Routing for Distributing Layered Video to Heterogeneous Receivers in Rate-based Networks
We design an effective multicast routing algorithm for distributing layered multicast video to heterogeneous receivers in networks with rate-based link schedulers. The multicast tree constructed by the algorithm fulfills the QoS requirements imposed by heterogeneous receivers both in terms of bandwidth and delay, and at the same time, consumes as little network resource as possible. For the pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004